Inapproximability of Maximum <i>r</i>-Regular Induced Connected Subgraph Problems
نویسندگان
چکیده
منابع مشابه
Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems
Given a graph G = (V,E) on n vertices, the MAXIMUM r-REGULAR INDUCED CONNECTED SUBGRAPH (r-MaxRICS) problems ask for a maximum sized subset of vertices S ⊆ V such that the induced subgraph G[S] on S is connected and r-regular. For r = 2, it is known that 2-MaxRICS is NP-hard and cannot be approximated within a factor of n1−ε in polynomial time for any ε > 0 if P 6 = NP . In this paper, we show ...
متن کاملFast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V,E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R ⊆ V such that the induced subgraph on R, G[R], is r-regular. We give an O(c) time algorithm for these problems for any fixed constant r, where c is a positive constant strictly less than 2, solving a well known open problem. These algorithms are then genera...
متن کاملClique and Constraint Models for Maximum Common (Connected) Subgraph Problems
The maximum common subgraph problem is to find the largest subgraph common to two given graphs. This problem can be solved either by constraint-based search, or by reduction to the maximum clique problem. We evaluate these two models using modern algorithms, and see that the best choice depends mainly upon whether the graphs have labelled edges. We also study a variant of this problem where the...
متن کاملAlgorithms for the Maximum Weight Connected k -Induced Subgraph Problem
Finding differentially regulated subgraphs in a biochemical network is an important problem in bioinformatics. We present a new model for finding such subgraphs which takes the polarity of the edges (activating or inhibiting) into account, leading to the problem of finding a connected subgraph induced by k vertices with maximum weight. We present several algorithms for this problem, including d...
متن کاملImproved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction of edges are properly colored (i.e. their endpoints receive different colors). A random k-coloring properly colors an expected fraction 1 − 1 k of edges. We prove that given a graph promised to be k-colorable, it is N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2013
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e96.d.443